Integrated dynamic distributed routing and admission control in ATM networks
Identifieur interne : 002972 ( Main/Exploration ); précédent : 002971; suivant : 002973Integrated dynamic distributed routing and admission control in ATM networks
Auteurs : R. Bolla [Italie] ; A. Dalal'Ah [Italie] ; F. Davoli [Italie] ; M. Marchese [Italie] ; M. S. Obaidat [États-Unis]Source :
- International Journal of Communication Systems [ 1074-5351 ] ; 1997-09.
English descriptors
Abstract
A node‐by‐node admission control and routing scheme for ATM networks is devised. The scheme is based on the subdivision of traffic into a number of classes, characterized by different performance requirements. At each network node, for all outgoing links, link capacity partitions are periodically assigned to the traffic classes, as the result of an optimization problem over a fixed time interval. Local access control rules compute the maximum number of connections of each class that a link can accept within the assigned capacity. Incoming call connection requests are forwarded in a hop‐by‐hop fashion. Each node traversed, first checks the presence of resources needed to accept a new connection and guarantee all quality of service (QoS) requirements. This is done by using the local access control rule. Then, it chooses the next node along the path on the basis of a distributed routing strategy. This minimizes a cost function accounting for local instantaneous information, as well as for aggregate information that is passed periodically among adjacent nodes. Two routing strategies are introduced. In the first scheme, a new call is rejected if, at a certain node along the path, there are not enough resources to guarantee QoS requirements, and no recovery mechanism is implemented. In the second scheme, an alternative path is looked for after the first failure. Simulation results are presented which show a comparison between the two proposed routing strategies. Comparison is also made between the proposed scheme and the other approaches. © 1997 John Wiley & Sons, Ltd.
Url:
DOI: 10.1002/(SICI)1099-1131(199709/10)10:5<215::AID-DAC340>3.0.CO;2-3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001490
- to stream Istex, to step Curation: 001490
- to stream Istex, to step Checkpoint: 000D90
- to stream Main, to step Merge: 002A92
- to stream Main, to step Curation: 002972
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Integrated dynamic distributed routing and admission control in ATM networks</title><author><name sortKey="Bolla, R" sort="Bolla, R" uniqKey="Bolla R" first="R." last="Bolla">R. Bolla</name></author><author><name sortKey="Dalal Ah, A" sort="Dalal Ah, A" uniqKey="Dalal Ah A" first="A." last="Dalal'Ah">A. Dalal'Ah</name></author><author><name sortKey="Davoli, F" sort="Davoli, F" uniqKey="Davoli F" first="F." last="Davoli">F. Davoli</name></author><author><name sortKey="Marchese, M" sort="Marchese, M" uniqKey="Marchese M" first="M." last="Marchese">M. Marchese</name></author><author><name sortKey="Obaidat, M S" sort="Obaidat, M S" uniqKey="Obaidat M" first="M. S." last="Obaidat">M. S. Obaidat</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:FB18B553846A522B71E328401DFF463D151F7F5D</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1002/(SICI)1099-1131(199709/10)10:5<215::AID-DAC340>3.0.CO;2-3</idno><idno type="url">https://api.istex.fr/document/FB18B553846A522B71E328401DFF463D151F7F5D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001490</idno><idno type="wicri:Area/Istex/Curation">001490</idno><idno type="wicri:Area/Istex/Checkpoint">000D90</idno><idno type="wicri:doubleKey">1074-5351:1997:Bolla R:integrated:dynamic:distributed</idno><idno type="wicri:Area/Main/Merge">002A92</idno><idno type="wicri:Area/Main/Curation">002972</idno><idno type="wicri:Area/Main/Exploration">002972</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Integrated dynamic distributed routing and admission control in ATM networks</title><author><name sortKey="Bolla, R" sort="Bolla, R" uniqKey="Bolla R" first="R." last="Bolla">R. Bolla</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Department of Communications, Computer and Systems Science (DIST), University of Genoa, Via Opera Pia 13, I‐16145 Genova</wicri:regionArea><wicri:noRegion>I‐16145 Genova</wicri:noRegion></affiliation></author><author><name sortKey="Dalal Ah, A" sort="Dalal Ah, A" uniqKey="Dalal Ah A" first="A." last="Dalal'Ah">A. Dalal'Ah</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Department of Communications, Computer and Systems Science (DIST), University of Genoa, Via Opera Pia 13, I‐16145 Genova</wicri:regionArea><wicri:noRegion>I‐16145 Genova</wicri:noRegion></affiliation></author><author><name sortKey="Davoli, F" sort="Davoli, F" uniqKey="Davoli F" first="F." last="Davoli">F. Davoli</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Department of Communications, Computer and Systems Science (DIST), University of Genoa, Via Opera Pia 13, I‐16145 Genova</wicri:regionArea><wicri:noRegion>I‐16145 Genova</wicri:noRegion></affiliation></author><author><name sortKey="Marchese, M" sort="Marchese, M" uniqKey="Marchese M" first="M." last="Marchese">M. Marchese</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Department of Communications, Computer and Systems Science (DIST), University of Genoa, Via Opera Pia 13, I‐16145 Genova</wicri:regionArea><wicri:noRegion>I‐16145 Genova</wicri:noRegion></affiliation></author><author><name sortKey="Obaidat, M S" sort="Obaidat, M S" uniqKey="Obaidat M" first="M. S." last="Obaidat">M. S. Obaidat</name><affiliation wicri:level="2"><country xml:lang="fr" wicri:curation="lc">États-Unis</country><wicri:regionArea>Department of Computer Science, Monmouth University, W. Long Branch, NJ 07764</wicri:regionArea><placeName><region type="state">New Jersey</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">International Journal of Communication Systems</title><title level="j" type="abbrev">Int. J. Commun. Syst.</title><idno type="ISSN">1074-5351</idno><idno type="eISSN">1099-1131</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>London</pubPlace><date type="published" when="1997-09">1997-09</date><biblScope unit="volume">10</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="215">215</biblScope><biblScope unit="page" to="225">225</biblScope></imprint><idno type="ISSN">1074-5351</idno></series><idno type="istex">FB18B553846A522B71E328401DFF463D151F7F5D</idno><idno type="DOI">10.1002/(SICI)1099-1131(199709/10)10:5<215::AID-DAC340>3.0.CO;2-3</idno><idno type="ArticleID">DAC340</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1074-5351</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>ATM traffic control</term><term>admission control</term><term>dynamic routing</term><term>quality of service</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A node‐by‐node admission control and routing scheme for ATM networks is devised. The scheme is based on the subdivision of traffic into a number of classes, characterized by different performance requirements. At each network node, for all outgoing links, link capacity partitions are periodically assigned to the traffic classes, as the result of an optimization problem over a fixed time interval. Local access control rules compute the maximum number of connections of each class that a link can accept within the assigned capacity. Incoming call connection requests are forwarded in a hop‐by‐hop fashion. Each node traversed, first checks the presence of resources needed to accept a new connection and guarantee all quality of service (QoS) requirements. This is done by using the local access control rule. Then, it chooses the next node along the path on the basis of a distributed routing strategy. This minimizes a cost function accounting for local instantaneous information, as well as for aggregate information that is passed periodically among adjacent nodes. Two routing strategies are introduced. In the first scheme, a new call is rejected if, at a certain node along the path, there are not enough resources to guarantee QoS requirements, and no recovery mechanism is implemented. In the second scheme, an alternative path is looked for after the first failure. Simulation results are presented which show a comparison between the two proposed routing strategies. Comparison is also made between the proposed scheme and the other approaches. © 1997 John Wiley & Sons, Ltd.</div></front></TEI><affiliations><list><country><li>Italie</li><li>États-Unis</li></country><region><li>New Jersey</li></region></list><tree><country name="Italie"><noRegion><name sortKey="Bolla, R" sort="Bolla, R" uniqKey="Bolla R" first="R." last="Bolla">R. Bolla</name></noRegion><name sortKey="Dalal Ah, A" sort="Dalal Ah, A" uniqKey="Dalal Ah A" first="A." last="Dalal'Ah">A. Dalal'Ah</name><name sortKey="Davoli, F" sort="Davoli, F" uniqKey="Davoli F" first="F." last="Davoli">F. Davoli</name><name sortKey="Marchese, M" sort="Marchese, M" uniqKey="Marchese M" first="M." last="Marchese">M. Marchese</name></country><country name="États-Unis"><region name="New Jersey"><name sortKey="Obaidat, M S" sort="Obaidat, M S" uniqKey="Obaidat M" first="M. S." last="Obaidat">M. S. Obaidat</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002972 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002972 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:FB18B553846A522B71E328401DFF463D151F7F5D
|texte= Integrated dynamic distributed routing and admission control in ATM networks
}}
| This area was generated with Dilib version V0.6.21. |  |